Experimental Tests of Solutions to the Double-Marginalization Problem A Reference-Dependent Approach

نویسندگان

  • Teck-Hua Ho
  • Juanjuan Zhang
  • Taizan Chan
  • Kay-Yut Chen
  • Ganesh Iyer
  • Noah Lim
  • Jose Silva
چکیده

The \double-marginalization" problem associated with linear wholesale price contract has long been recognized as a threat to vertical channel coordination. Many solutions involving more complex contract formats have been proposed to address this problem. Extant economic theories predict these solutions to be revenue and division equivalent in that they all restore full channel e±ciency and give the same surplus to the upstream party assuming constant relative bargaining power. We conduct a laboratory experiment to test the empirical equivalence of two variants of a two-part tari® contract. The ̄rst variant charges the downstream party a ̄xed fee for participation and a uniform unit price. The second variant takes the form of a quantity discount contract with the total cost to the downstream party identical to that of the ̄rst variant for a given quantity. Surprisingly, the two-part tari® mechanism fails to solve the double-marginalization problem even in a well-controlled market environment. Both variants of the two-part tari® do not achieve full channel e±ciency; they are statistically no better than the linear wholesale price contract. Revenue equivalence fails because the second variant achieves a higher channel e±ciency than the ̄rst variant. Also, division equivalence does not hold because the second variant accords a higher surplus to the upstream party than the ̄rst variant. To account for the observed behavior, we allow the downstream party to have a referencedependent utility in which the upfront ̄xed fee is framed as loss and the subsequent contribution margin as gain. We derive a new set of theoretical predictions and estimate a structural model to infer the degree of loss aversion as well as the reservation utility of the downstream party. The estimated loss aversion coe±cient is 1.6 and the reservation utility ranges from 8% to 14% of the e±cient channel pro ̄t. We rule out other plausible explanations such as parties having fairness concerns and non-linear risk attitudes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

متن کامل

Helicopter Rotor Airloads Prediction Using CFD and Flight Test Measurement in Hover Flight

An implicit unsteady upwind solver including a mesh motion approach was applied to simulate a helicopter including body, main rotor and tail rotor in hover flight. The discretization was based on a second order finite volume approach with fluxes given by the Roeand#39;s scheme. Discretization of Geometric Conservation Laws (GCL) was devised in such a way that the three-dimensional flows on arbi...

متن کامل

A New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...

متن کامل

A Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times

 We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...

متن کامل

A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004